Parameterized algorithms for d-HITTING SET: The weighted case
Identifieur interne : 000D07 ( Main/Exploration ); précédent : 000D06; suivant : 000D08Parameterized algorithms for d-HITTING SET: The weighted case
Auteurs : Henning Fernau [Allemagne]Source :
- Theoretical computer science [ 0304-3975 ] ; 2010.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
We are going to analyze search tree algorithms for WEIGHTED d-HITTING SET. Although the algorithms that we develop are fairly simple, their analysis is technically involved. We compare the weighted case with the previously analyzed unweighted one, exhibiting that the advantage of the unweighted case dwindles with growing d.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000561
- to stream PascalFrancis, to step Curation: 000816
- to stream PascalFrancis, to step Checkpoint: 000375
- to stream Main, to step Merge: 000D66
- to stream Main, to step Curation: 000D07
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Parameterized algorithms for d-HITTING SET: The weighted case</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Univ. Trier, FB 4-Abteilung Informatik</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>FB 4-Abteilung Informatik</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">10-0172210</idno><date when="2010">2010</date><idno type="stanalyst">PASCAL 10-0172210 INIST</idno><idno type="RBID">Pascal:10-0172210</idno><idno type="wicri:Area/PascalFrancis/Corpus">000561</idno><idno type="wicri:Area/PascalFrancis/Curation">000816</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000375</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000375</idno><idno type="wicri:doubleKey">0304-3975:2010:Fernau H:parameterized:algorithms:for</idno><idno type="wicri:Area/Main/Merge">000D66</idno><idno type="wicri:Area/Main/Curation">000D07</idno><idno type="wicri:Area/Main/Exploration">000D07</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Parameterized algorithms for d-HITTING SET: The weighted case</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Univ. Trier, FB 4-Abteilung Informatik</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>FB 4-Abteilung Informatik</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author></analytic><series><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno><imprint><date when="2010">2010</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term><term>Search algorithm</term><term>Search tree</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Algorithme recherche</term><term>Arbre recherche</term><term>Informatique théorique</term><term>68Wxx</term><term>Recherche arborescence</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We are going to analyze search tree algorithms for WEIGHTED d-HITTING SET. Although the algorithms that we develop are fairly simple, their analysis is technically involved. We compare the weighted case with the previously analyzed unweighted one, exhibiting that the advantage of the unweighted case dwindles with growing d.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D07 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000D07 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:10-0172210
|texte= Parameterized algorithms for d-HITTING SET: The weighted case
}}
| This area was generated with Dilib version V0.6.31. |  |